Evaluating Conjunctive Triple Pattern Queries over Large Structured Overlay Networks
نویسندگان
چکیده
We study the problem of evaluating conjunctive queries composed of triple patterns over RDF data stored in distributed hash tables. Our goal is to develop algorithms that scale to large amounts of RDF data, distribute the query processing load evenly and incur little network traffic. We present and evaluate two novel query processing algorithms with these possibly conflicting goals in mind. We discuss the various tradeoffs that occur in our setting through a detailed experimental evaluation of the proposed algorithms.
منابع مشابه
Publish/Subscribe with RDF Data over Large Structured Overlay Networks
We study the problem of evaluating RDF queries over structured overlay networks. We consider the publish/subscribe scenario where nodes subscribe with long-standing queries and receive notifications whenever triples matching their queries are inserted in the network. In this paper we focus on conjunctive multi-predicate queries. We demonstrate that these queries are useful in various modern app...
متن کاملAdding Logical Operators to Tree Pattern Queries on Graph-Structured Data
As data are increasingly modeled as graphs for expressing complex relationships, the tree pattern query on graph-structured data becomes an important type of queries in real-world applications. Most practical query languages, such as XQuery and SPARQL, support logical expressions using logical-AND/OR/NOT operators to define structural constraints of tree patterns. In this paper, (1) we propose ...
متن کاملOn Lightweight Data Summaries for Optimised Query Processing over Linked Data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering. This time-consuming pre-processing phase however leverages the benefits of Linked Data – where structured data is accessible live and up-to-date at distributed Web resources that may change constantly – only to a limi...
متن کاملOn the Design of Semi-structured Multi-star Hybrid-Overlays for Multi-attribute Range Queries
In the past few years, resource discovery is an important mechanism in P2P applications. P2P networks could be categorized into structured and unstructured. In general, structured P2P networks (DHTs) provide efficient keyword search, but is difficult to offer a variety of search modes. Unstructured P2P networks are applied to highly churn P2P networks, but they are inefficient. In this paper, w...
متن کاملDistributed Processing of Generalized Graph-Pattern Queries in SPARQL 1.1
We propose an efficient and scalable architecture for processing generalized graph-pattern queries as they are specified by the current W3C recommendation of the SPARQL 1.1 “Query Language” component. Specifically, the class of queries we consider consists of sets of SPARQL triple patterns with labeled property paths. From a relational perspective, this class resolves to conjunctive queries of ...
متن کامل